Fast-on*: an Extended Algorithm for Graph Isomorphism Problem and Graph Query Processing
نویسندگان
چکیده
Graphs are widely used to model complicated data semantics in many applications. In our paper [8], we proposed Fast-ON, an efficient algorithm for subgraph isomorphism problem. In this paper, we develop an efficient algorithm called Fast-ON* that extends Fast-ON to handle two other problems, namely, graph isomorphism problem and graph query processing. Our performance study shows that Fast-ON* outperforms previously proposed algorithms of the two problems with a wide margin.
منابع مشابه
An Effective Path-aware Approach for Keyword Search over Data Graphs
Abstract—Keyword Search is known as a user-friendly alternative for structured languages to retrieve information from graph-structured data. Efficient retrieving of relevant answers to a keyword query and effective ranking of these answers according to their relevance are two main challenges in the keyword search over graph-structured data. In this paper, a novel scoring function is proposed, w...
متن کاملEfficient algorithms for supergraph query processing on graph databases
We study the problem of processing supergraph queries on graph databases. A graph database D is a large set of graphs. A supergraph query q on D is to retrieve all the graphs in D such that q is a supergraph of them. The large number of graphs in databases and the NP-completeness of subgraph isomorphism testing make it challenging to efficiently processing supergraph queries. In this paper, a n...
متن کاملGiS: Fast Indexing and Querying of Graph Structures
We propose a new way of indexing a large database of graphs and processing exact subgraph matching (or subgraph isomorphism) and approximate (full) graph matching queries. Rather that decomposing a graph into smaller units (e.g., paths, trees, graphs) for indexing purposes, we represent each graph in the database by its graph signature, which is essentially a multiset, and each signature is the...
متن کاملFast Practical Algorithm Based on Weisfeiler-lehman Method for Graph Isomorphism
Graph isomorphism problem is to determine whether two given graphs are isomorphic. It is a particular type of a more general problem “the isomorphism of incidence system”. I propose some new invariants for heuristic search of graph isomorphism and demonstrate that they are really useful in practice by experiments. Keyword. graph isomorphism, graph invariant, graph spectrum , adjacency matrix, m...
متن کاملBB-Graph: A New Subgraph Isomorphism Algorithm for Efficiently Querying Big Graph Databases
With the emergence of the big data concept, the big graph database model has become very popular since it provides strong modeling for complex applications and fast querying, especially for the cases that require costly join operations in RDBMs. However, it is a big challenge to find all exact matches of a query graph in a big graph database, which is known as the subgraph isomorphism problem. ...
متن کامل